'Knowable' as 'known after an announcement'

Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: ♦φ expresses that there is a truthful announcement ψ after which φ is true. This logic gives a perspective on Fitch’s knowability issues: for which formulas φ does it hold that φ → ♦Kφ? We give various semantic results, and we show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.